#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL map1[maxn];
bool cmp(LL a,LL b){
    return a>b;
}
bool check(LL mid,LL len){
    LL st=1;
    for(LL i=1;map1[i]&&i<=len;i++){
        LL sum=map1[i];
        for(LL j=st;sum>0&&j<=len;j+=(mid+1)){
            sum--;
        }
        if(sum>0) return false;
        st++;
    }
    return true;
}
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    memset(map1,0,sizeof(map1));
    for(LL i=1;i<=n;i++){
        LL x;cin>>x;
        map1[x]++;
    }
    sort(map1+1,map1+1+n,cmp);
    LL l=0;LL r=n;
    while(l<r){
        LL mid=(l+r+1)>>1;
        if(check(mid,n)) l=mid;
        else r=mid-1;
    }
    cout<<l<<"\n";
  }
return 0;
}
